String averages and self-organizing maps for strings

نویسندگان

  • Igor Fischer
  • Andreas Zell
چکیده

In a recent paper, T. Kohonen and P. Somervuo have shown that self-organizing maps (SOMs) are not restricted to numerical data. They can also be defined for symbol strings, provided that one defines an average function for strings and that the adaptation process is performed off-line (batch). In this paper, we present two different methods for computing averages of strings, as well as an on-line version of the self-organizing map for strings. Both methods for computing averages are faster than the original one used by Kohonen and Somervuo, and one of them is suitable for on-line computation. Keywords—Self-organizing map; String average; String clustering.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-organizing maps of symbol strings

Unsupervised self-organizing maps (SOMs), as well as supervised learning by Learning Vector Quantization (LVQ) can be defined for string variables, too. Their computing becomes possible when the SOM and the LVQ algorithms are expressed as batch versions, and when the average over a list of symbol strings is defined to be the string that has the smallest sum of generalized distance functions fro...

متن کامل

Pattern recognition algorithms for symbol strings

Traditionally, pattern recognition has been concerned mostly with numerical data, i.e. vectors of real-valued features. Less often, symbolic representations of data have been used. A special category of data, symbol strings, have been neglected for a long time, partially because of a perceived lack of urgency and partially because of the high computational costs involved. Only recently, motivat...

متن کامل

Processing Symbolic Data With Self-Organizing Maps

Current research on machine learning and related algorithms is focused mainly on numeric paradigms. It is, however, widely supposed that intelligent behavior strongly relies on ability to manipulate symbols. In this paper we present on-line versions of self-organizing maps for symbol strings. The underlying key concepts are average and similarity, applied on strings. These concepts are easily d...

متن کامل

Self-Organizing Maps of Symbol Strings with Application to Speech Recognition

SOM and LVQ algorithms for symbol strings have been introduced and applied to isolatedword recognition, for the construction of an optimal pronunciation dictionary for a given speech recognizer.

متن کامل

Online algorithm for the self-organizing map of symbol strings

In this work an online algorithm is presented for the construction of the self-organizing map (SOM) of symbol strings. Each node of the SOM grid is associated with a model string which is a variable-vector sequence. Smooth interpolation method is applied in the training which performs simultaneous adaptation of the symbol content and the length of the model string. The efficiency of the method ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000